Strictly chained (p, q)-ary partitions
نویسندگان
چکیده
We consider a special type of integer partitions in which the parts of the form pq, for some relatively prime integers p and q, are restricted by divisibility conditions. We investigate the problems of generating and encoding those partitions and give some estimates for several partition functions.
منابع مشابه
On the maximal weight of $(p,q)$-ary chain partitions with bounded parts
A (p, q)-ary chain is a special type of chain partition of integers with parts of the form pq for some fixed integers p and q. In this note, we are interested in the maximal weight of such partitions when their parts are distinct and cannot exceed a given bound m. Characterizing the cases where the greedy choice fails, we prove that this maximal weight is, as a function of m, asymptotically ind...
متن کاملStrictly Nonblocking f -cast d-ary Multi-log Networks under Fanout and Crosstalk Constraints
We derive conditions which are both necessary and sufficient for the d-ary multi-log switching networks to be f cast strictly nonblocking under all combinations of fanout and crosstalk constraints. The fanout constraint tells us which stage(s) of the networks has fanout capability. The crosstalk constraint tells us whether or not two connection routes are allowed to share a link (relevant to el...
متن کاملOn Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
We discuss two distance concepts between q-ary n-sequences, 2 ≤ q < n, called partition distances. This distances are metrics in the space of all partitions of a finite n-set. For the metrics, we study codes called q-partition codes and present a construction of these codes based on the first order Reed– Muller codes. A random coding bound is obtained. We also work out an application of q-parti...
متن کاملOn a general class of non-squashing partitions
We define M-sequence non-squashing partitions, which specialize to m-ary partitions Sloane, among others), factorial partitions, and numerous other general partition families of interest. We establish an exact formula, various combinatorial interpretations, as well as the asymptotic growth of M-sequence non-squashing partition functions, functions whose associated generating functions are non-m...
متن کاملOn reducibility of n-ary quasigroups, II
An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 2010